Symbolic Model Checking of Concurrent Probabilistic Systems Using MTBDDs and the Simplex Algorithm

نویسندگان

  • Marta Kwiatkowska
  • Gethin Norman
  • David Parker
  • Roberto Segala
چکیده

Symbolic model checking for purely probabilistic processes using MTB-DDs 12] was introduced in 4] and further developed in 20, 3]. In this paper we consider models for concurrent probabilistic systems similar to those of 28, 7, 5] and the concurrent Markov chains of 35, 13], which extend the purely probabilistic processes through the addition of nondeterministic choice. As a speciication formalism we use the probabilistic branching-time temporal logic PBTL of 5, 7], which allows us to express properties such as \under any scheduling of nondeterministic choices, the probability of holding until is true is at least 0.78". In 5, 7] it is shown that the veriication of \until" properties can be reduced to a linear programming problem and solved with the help of e.g. the simplex algorithm, but no symbolic model checking is considered. Based on the algorithms of 5, 7], we derive symbolic model checking procedure for PBTL over concurrent probabilistic systems using MTBDDs, and extend it with fairness constraints. We furthermore implement an experimental model checker using the Colorado University Decision Diagram (CUDD) package 32]. Our key contribution is an implementation of the simplex algorithm in terms of MTBDDs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbolic Model Checking of Concurrent Probabilistic Systems Using MTBDDs and Simplex∗

Symbolic model checking for purely probabilistic processes using MTBDDs [12] was introduced in [4] and further developed in [20, 3]. In this paper we consider models for concurrent probabilistic systems similar to those of [28, 7, 5] and the concurrent Markov chains of [35, 13], which extend the purely probabilistic processes through the addition of nondeterministic choice. As a specification f...

متن کامل

Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation

This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent probabilistic systems as models; these allow nondeterministic choice between probability distributions and are particularly well suited to modelling distributed systems with probabilistic behaviour, e.g. randomized c...

متن کامل

Verifying Randomized Distributed Algorithms with PRISM?

In this paper we describe our experience with model checking randomized distributed algorithms using PRISM, a symbolic model checker for concurrent probabilistic systems currently being developed. PRISM uses Multi-Terminal Binary Decision Diagrams (MTBDDs) as supplied by the CUDD package of Fabio Somenzi. Implemented in Java, PRISM has a system description language similar to Reactive Modules a...

متن کامل

An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata

Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for Probabilistic Timed Automata (PTA) based on MTBDDs. The timing information is encoded via placeholders stored in the MTBDDs that are independent of how the timing information is represented. Using the Colorado Univer...

متن کامل

IMPLEMENTATION OF SYMBOLIC MODEL CHECKING FOR PROBABILISTIC SYSTEMS by DAVID

In this thesis, we present efficient implementation techniques for probabilistic model checking, a method which can be used to analyse probabilistic systems such as randomised distributed algorithms, fault-tolerant processes and communication networks. A probabilistic model checker inputs a probabilistic model and a specification, such as “the message will be delivered with probability 1”, “the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999